Supra-convergent schemes on irregular grids
نویسندگان
چکیده
منابع مشابه
Supra-Convergent Schemes on Irregular Grids
As Tikhonov and Samarskiï showed for k = 2, it is not essential that Ath-order compact difference schemes be centered at the arithmetic mean of the stencil's points to yield second-order convergence (although it does suffice). For stable schemes and even k, the main point is seen when the k th difference quotient is set equal to the value of the k th derivative at the middle point of the stenci...
متن کاملSupra-convergence of Linear Equations on Irregular Cartesian Grids
We prove the second order convergence of a class of finite difference schemes for linear heat equations, and wave equations on irregular grids. Numerical examples and convergence studies are provided to demonstrate our theoretical results.
متن کاملAccuracy Analysis for Finite-volume Discretization Schemes on Irregular Grids
A new computational analysis tool, downscaling test, is introduced and applied for studying the convergence rates of truncation and discretization errors of finite-volume discretization schemes on general irregular (e.g., unstructured) grids. The study shows that the design-order convergence of discretization errors can be achieved even when truncation errors exhibit a lower-order convergence o...
متن کاملA supra-convergent finite difference scheme for the variable coefficient Poisson equation on non-graded grids
We introduce a method for solving the variable coefficient Poisson equation on non-graded Cartesian grids that yields second order accuracy for the solutions and their gradients. We employ quadtree (in 2D) and octree (in 3D) data structures as an efficient means to represent the Cartesian grid, allowing for constraint-free grid generation. The schemes take advantage of sampling the solution at ...
متن کاملA Supra-Convergent Finite Difference Scheme for the Variable Coefficient Poisson Equation on Fully Adaptive Grids
We introduce a method for solving the variable coefficient Poisson equation on fully adaptive Cartesian grids that yields second order accuracy for the solutions and their gradients. We employ quadtree (in 2D) and octree (in 3D) data structures as an efficient means to represent the Cartesian grid, allowing for constraint-free grid generation. The schemes take advantage of sampling the solution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1986
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1986-0856701-5